Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), z)
APP2(not, app2(app2(or, x), y)) -> APP2(not, y)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(and, x)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), y)
APP2(not, app2(app2(or, x), y)) -> APP2(app2(and, app2(not, x)), app2(not, y))
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
APP2(not, app2(app2(or, x), y)) -> APP2(not, x)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(or, app2(app2(and, x), y))
APP2(not, app2(app2(or, x), y)) -> APP2(and, app2(not, x))
APP2(not, app2(app2(and, x), y)) -> APP2(or, app2(not, x))
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(or, app2(app2(and, x), y))
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
APP2(not, app2(app2(and, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(app2(or, app2(not, x)), app2(not, y))
APP2(not, app2(app2(and, x), y)) -> APP2(not, y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), z)

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), z)
APP2(not, app2(app2(or, x), y)) -> APP2(not, y)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(and, x)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), y)
APP2(not, app2(app2(or, x), y)) -> APP2(app2(and, app2(not, x)), app2(not, y))
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
APP2(not, app2(app2(or, x), y)) -> APP2(not, x)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(or, app2(app2(and, x), y))
APP2(not, app2(app2(or, x), y)) -> APP2(and, app2(not, x))
APP2(not, app2(app2(and, x), y)) -> APP2(or, app2(not, x))
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(or, app2(app2(and, x), y))
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
APP2(not, app2(app2(and, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(app2(or, app2(not, x)), app2(not, y))
APP2(not, app2(app2(and, x), y)) -> APP2(not, y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), z)

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 2 SCCs with 9 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), z)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), z)

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
QDP
            ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

APP2(not, app2(app2(or, x), y)) -> APP2(not, x)
APP2(not, app2(app2(or, x), y)) -> APP2(not, y)
APP2(not, app2(app2(and, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(not, y)

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

APP2(not, app2(app2(or, x), y)) -> APP2(not, x)
APP2(not, app2(app2(or, x), y)) -> APP2(not, y)
APP2(not, app2(app2(and, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(not, y)
Used argument filtering: APP2(x1, x2)  =  x2
app2(x1, x2)  =  app2(x1, x2)
or  =  or
and  =  and
Used ordering: Quasi Precedence: trivial


↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPAfsSolverProof
QDP
                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.